An Iterative Domain Decomposition Procedure for the Reduced Basis Method
نویسنده
چکیده
Reduced basis methods allow efficient model reduction of parametrized partial differential equations. In the current paper, we consider a reduced basis scheme for homogeneous domain decomposition problems. The method is based on iterative Dirichlet-Neumann coupling. We prove convergence of the iterative reduced scheme, derive rigorous a-posteriori error bounds and provide a full offline/online decomposition. Different methods for basis generation are investigated, in particular a variant of the POD-Greedy procedure. Experiments confirm the rigor of the error estimators and identify beneficial basis construction procedures.
منابع مشابه
Finding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملOutput Error Bounds for the Dirichlet-Neumann Reduced Basis Method
The Dirichlet-Neumann reduced basis method is a model order reduction method for homogeneous domain decomposition of elliptic PDE’s on a-priori known geometries. It is based on an iterative scheme with full offline-online decomposition and rigorous a-posteriori error estimates. We show that the primal-dual framework for non-compliant output quantities can be transferred to this method. The resu...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملA Space Decomposition Method for Parabolic Equations
A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(jlog j) steps of itera...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کامل